First passage times for Slepian process with linear and piecewise linear barriers
نویسندگان
چکیده
Abstract In this paper, we derive explicit formulas for the first-passage probabilities of process S ( t ) = W − + 1), where is Brownian motion, linear and piece-wise barriers on arbitrary intervals [0, T ]. Previously, were known only cases a constant barrier or ≤ 1. The results are used to power familiar test change-point detection in Wiener process.
منابع مشابه
First passage time for Brownian motion and piecewise linear boundaries
We propose a new approach to calculating the first passage time densities for Brownian motion crossing piecewise linear boundaries which can be discontinuous. Using this approach we obtain explicit formulas for the first passage densities and show that they are continuously differentiable except at the break points of the boundaries. Furthermore, these formulas can be used to approximate the fi...
متن کاملThe implications of piecewise linear process of normal accruals
The present study investigates whether the basic assumption in the Jones model, which normal accruals are a linear function of change in sales, is empirically valid. It also discusses and addresses the implications of the assumption violation in the earnings management detection tests. The research employs a sample of 2832 observations of the annual information of firms listed in Tehran Stock E...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولnetwork optimization with piecewise linear convex costs
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Extremes
سال: 2021
ISSN: ['1386-1999', '1572-915X']
DOI: https://doi.org/10.1007/s10687-021-00406-6